Algebraic Polygons

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algebraic cubature formula on curvilinear polygons

We implement in Matlab a Gauss-like cubature formula on bivariate domains whose boundary is a piecewise smooth Jordan curve (curvilinear polygons). The key tools are Green’s integral formula, together with the recent software package chebfun to approximate the boundary curve close to machine precision by piecewise Chebyshev interpolation. Several tests are presented, including some comparisons ...

متن کامل

Newton Polygons of Higher Order in Algebraic Number Theory

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a p-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by Ø. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and i...

متن کامل

An Introduction to Algebraic Geometry: Polygons, Parameterizations, and Equations

We explain how four surfaces that are ubiquitous in algebraic geometry may be obtained from convex polygons whose vertices have integer coordinates, realizing these surfaces as examples of toric varieties. We highlight the combinatorial and algebraic properties revealed by this construction. Our claim of novelty is in our particular combination of the toric, classical geometric, and algebraic p...

متن کامل

Algebraic distance in algebraic cone metric spaces and its properties

In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.

متن کامل

On the Algebraic Geometry of Contact Formation Cells for Systems of Polygons

The efficient planning of contact tasks for intelligent robotic systems requires a thorough understanding of the kinematic constraints im on the system by C l J form analytic eolutionrr for the poeition and orientation of a pamive polygon moving in contact with two or three active polygonrr whoee itions and orientations are independently c o n t r o l E This is done by applying elimination tech...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1996

ISSN: 0021-8693

DOI: 10.1006/jabr.1996.0179